Vertex-Edge-Degree-Based Topological Properties for Hex-Derived Networks
نویسندگان
چکیده
A topological index can be focused on uprising of a chemical structure into real number. The degree-based indices have an active place among all indices. These descriptors intentionally associate certain physicochemical assets the corresponding compounds. Graph theory plays very useful role in such type research directions. hex-derived networks vast applications computer science, physical sciences, and medical these are constructed by hexagonal mesh networks. In this paper, we determined exact values vertex-edge-degree-based for HDN 1 p id="M2"> 2 , which generated network dimension id="M3"> .
منابع مشابه
On discriminativity of vertex-degree-based indices
A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...
متن کاملTopological finiteness for edge-vertex enumeration
The number of PL-homeomorphism types of combinatorial manifolds in a fixed dimension with an upper bound on g2 is finite. At the intersection of topological and enumerative combinatorics is the relationship between the f -vector of simplicial complex and its topology. The Euler-Poincaré formula is perhaps the oldest such result. More recently, the complete characterization of all possible f -ve...
متن کاملM-polynomial and degree-based topological indices
Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملOn the eigenvalues of some matrices based on vertex degree
The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2022
ISSN: ['1099-0526', '1076-2787']
DOI: https://doi.org/10.1155/2022/7025480